Trade-offs between Communication Throughput and Parallel Time

Trade-oos between Communication Throughput and Parallel Time

We study the eeect of limited communication throughput on parallel computation in a setting where the number of processors is much smaller than the length of the input. Our model has p processors that communicate through a shared memory of size m. The input has size n, and can be read directly by all the processors. We will be primarily interested in studying cases where n p m. As a test case w...

On Throughput-Smoothness Trade-offs in Streaming Communication

Unlike traditional file transfer where only total delay matters, streaming applications impose delay constraints on each packet and require them to be in order. To achieve fast in-order packet decoding, we have to compromise on the throughput. We study this trade-off between throughput and smoothness in packet decoding. We first consider a point-to-point streaming and analyze how the trade-off ...

On Throughput-Delay Trade-offs in Streaming Communication

Time-Space Trade-Offs in Parallel and Neural Computing

To which extend can we speak about time-space tradeoffs in the sense that, for a given problem, a faster algorithm requires more space than a slower algorithm? Furthermore, to which extend can we speak about such trade-offs in the context of parallel or neural computing? This paper aims to give an insight to these problems. The parallel computation thesis, first proposed in print in [Ch.S.76], ...

Information trade-offs for optical quantum communication

Recent work has precisely characterized the achievable trade-offs between three key information processing tasks-classical communication (generation or consumption), quantum communication (generation or consumption), and shared entanglement (distribution or consumption), measured in bits, qubits, and ebits per channel use, respectively. Slices and corner points of this three-dimensional region ...